Compositional Verification of Knowledge-Based Systems: A Case Study for Diagnostic Reasoning

نویسندگان

  • Frank Cornelissen
  • Catholijn M. Jonker
  • Jan Treur
چکیده

In this paper a compositional verification method for models of knowledge-based systems is introduced. Required properties of the system are formally verified by deriving them from assumptions that themselves are properties of sub-components, which in their turn may be derived from assumptions on sub-sub-components, and so on. The method is based on properties that are formalised in terms of temporal semantics; both static and dynamic properties are covered. The compositional verification method imposes structure on the verification process. By the possibility to focus at one level of abstraction (information and process hiding), compositional verification provides transparency and limits the complexity per level. Since verification proofs are structured in a compositional manner, they can be reused in case of modification of the system. The method is illustrated for a generic model for diagnostic reasoning.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compositional Verification of Knowledge-Based Systems in Temporal Epistemic Logic

It is a recent trend in the literature on verification to study the use of compositionality and abstraction to structure the process of verification; for example, see (Abadi and Lamport, 1993; Hooman, 1994; Dams, Gerth and Kelb, 1996). In (Cornelissen, Jonker and Treur, 1997) a compositional verification method was introduced for logic-based specifications of knowledge-based systems. The curren...

متن کامل

Compositional Reasoning for Hardware/Software Co-verification

In this paper, we present and illustrate an approach to compositional reasoning for hardware/software co-verification of embedded systems. The major challenges in compositional reasoning for co-verification include: (1) the hardware/software semantic gaps, (2) lack of common property specification languages for hardware and software, and (3) lack of compositional reasoning rules that are applic...

متن کامل

Formal Notions for Verification of Dynamics of Knowledge-Based Systems

In the literature on validation or verification of knowledge-based systems often a limitation to systems with one knowledge base is chosen, and the focus is on the static properties of these systems. In practice often knowledge-based systems are developed that have some form of compositional structure. Also the reasoning in this structure is controlled, often according to the compositional stru...

متن کامل

INTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING

Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...

متن کامل

Compositional probabilistic verification through multi-objective model checking

Compositional approaches to verification offer a powerful means to address the challenge of scalability. In this paper, we develop techniques for compositional verification of probabilistic systems based on the assume-guarantee paradigm. We target systems that exhibit both nondeterministic and stochastic behaviour, modelled as probabilistic automata, and augment these models with costs or rewar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997